Constraint propagation on quadratic constraints

A constraint-propagation approach to quantified constraints

Some complex problems could be tackled more satisfactorily by constraint programming tools if it were possible to state arbitrarily quantified constraints. Real-valued quantified constraints have been considered in the field of mathematical programming for more than fifty years, while discrete (boolean) quantified constraints have recently received attention from the SAT community. No direct co...

Constraint Propagation for Soft Constraints: Generalization and Termination Conditions

Constraint Propagation on Multiple Domains

In previous work we have presented a simple generic framework to solve constraints on any domain (finite or infinite) which has a lattice structure. The approach is based on the use of a single constraint similar to the indexicals used by constraint logic programming (CLP) over finite domains and on a particular definition of an interval lattice built from any computation domain. In this paper ...

Fast Constraint Propagation on Specialized

In this paper we present a specialization of Allen interval networks that permits the rapid determination as to whether a given interval must be occurring at the current point in time. The Allen-closure of the interval network is projected into a 3-valued (past,now,fut) constraint network called a PNF-network. We show that the minimal domain of a PNF-network can be approximately computed in lin...

Reasoning on Constraints in Constraint

Constraint Logic Programming solvers on nite domains use constraints to prune those combinations of assignments which cannot appear in any consistent solution. There are applications, such as temporal reasoning or scheduling, requiring some form of qualitative reasoning where constraints can be changed (restricted) during the computation or even chosen when disjunc-tion occurs. We embed in a CL...